Inclusion-Exclusion and Network Reliability
نویسنده
چکیده
Based on a recent improvement of the inclusion-exclusion principle, we present a new approach to network reliability problems. In particular, we give a new proof of a result of Shier, which expresses the reliability of a network as an alternating sum over chains in a semilattice, and a new proof of a result of Provan and Ball, which provides an algorithm for computing network reliability in pseudopolynomial time. Moreover, some results on k-out-of-n systems are established.
منابع مشابه
Improved Inclusion-Exclusion Identities and Inequalities Based on a Particular Class of Abstract Tubes
Recently, Naiman and Wynn introduced the concept of an abstract tube in order to obtain improved inclusion-exclusion identities and inequalities that involve much fewer terms than their classical counterparts. In this paper, we introduce a particular class of abstract tubes which plays an important role with respect to chromatic polynomials and network reliability. The inclusionexclusion identi...
متن کاملDirected Acyclic Graph Based Reliability Computation of a Network with Imperfect Nodes
In this paper, a heuristic is proposed to find out the reliability of a directed network by using directed acyclic graph. This directed network has imperfect nodes as well as imperfect links. Directed acyclic graph based reliability computation involves three main steps: In the first step, built the reliability function of the given directed network which is the union of all min-paths from sour...
متن کاملCutset Enumerating and Network Reliability Computing by a new Recursive Algorithm and Inclusion Exclusion Principle
Chang, Y. -R. , Lin, H. -Y. , Chen, I. -Y. & Kuo, S. -Y. , A Cut-Based Algorithm for Reliability Analysis of Terminal-Pair Network Using OBDD, Proceedings of the 27th Annual International Conference on Computer Software and Applications, 2003. Fard, N. S. & Lee, T. -H. , Cutset enumeration of network systems with link and node failures, Reliability Engineering and System Safety 1999, pp. 141 14...
متن کاملAn alternate Approach to Compute the Reliability of a Network with Imperfect Nodes using Binary Decision Diagrams
In this paper i have adopted an efficient approach for calculating the reliability of the computer communication network with the help of binary decision diagram. The computer communication network has imperfect nodes and imperfect links. It means the nodes as well as the communication links may fail with known probability. The network is represented in the form of a directed graph. First i hav...
متن کاملA Full Characterization of Irrelevant Components in Diameter Constrained Reliability
In classical network reliability analysis, the system under study is a network with perfect nodes but imperfect link, that fail stochastically and independently. There, the goal is to find the probability that the resulting random graph is connected, called reliability. Although the exact reliability computation belongs to the class of NP-Hard problems, the literature offers three exact methods...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 5 شماره
صفحات -
تاریخ انتشار 1998